Projecting points onto planar parametric curves by local biarc approximation
نویسندگان
چکیده
This paper proposes a geometric iteration algorithm for computing point projection and inversion on planar parametric curves based on local biarc approximation. The iteration begins with initial estimation of the projection of the prescribed test point. For each iteration, we construct a biarc that locally approximates a segment on the original curve starting from the current projective point. Then we compute the projective point for the next iteration, as well as the parameter corresponding to it, by projecting the test point onto this biarc. The iterative process terminates when the projective point satisfies the required precision. Examples demonstrate that our algorithm converges faster and is less dependent on the choice of the initial value compared to the traditional geometric iteration algorithms based on single-point approximation.
منابع مشابه
Efficient circular arc interpolation based on active tolerance control
In this paper, we present an ef®cient sub-optimal algorithm for ®tting smooth planar parametric curves by G 1 arc splines. To ®t a parametric curve by an arc spline within a prescribed tolerance, we ®rst sample a set of points and tangents on the curve adaptively as well as with enough density, so that an interpolation biarc spline curve can be with any desired high accuracy. Then, we construct...
متن کاملMedial axis computation for planar free-form shapes
We present a simple, efficient, and stable method for computing—with any desired precision—the medial axis of simply connected planar domains. The domain boundaries are assumed to be given as polynomial spline curves. Our approach combines known results from the field of geometric approximation theory with a new algorithm from the field of computational geometry. Challenging steps are (1) the a...
متن کاملCapturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کاملGlobal Radii of Curvature, and the Biarc Approximation of Space Curves: in Pursuit of Ideal Knot Shapes
The distance from self-intersection of a (smooth and either closed or infinite) curve q in three dimensions can be characterised via the global radius of curvature at q(s), which is defined as the smallest possible radius amongst all circles passing through the given point and any two other points on the curve. The minimum value of the global radius of curvature along the curve gives a convenie...
متن کاملOn geometric interpolation by planar parametric polynomial curves
In this paper the problem of geometric interpolation of planar data by parametric polynomial curves is revisited. The conjecture that a parametric polynomial curve of degree ≤ n can interpolate 2n given points in R2 is confirmed for n ≤ 5 under certain natural restrictions. This conclusion also implies the optimal asymptotic approximation order. More generally, the optimal order 2n can be achie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 38 شماره
صفحات -
تاریخ انتشار 2014